Method, processing device and system for managing copies of media samples in a system comprising a plurality of interconnected network cameras

ABSTRACT

The present invention relates to a method for managing copies of media samples recorded by a given network camera of a system comprising a plurality of interconnected network cameras, the method comprising the following steps:
         obtaining a topology of the system as a set of relationships existing between the network cameras of the plurality, based on media samples recorded by these network cameras;   selecting a subset of network cameras from the plurality, based on the determined topology and a predetermined level of redundancy to achieve, for the storage of the copies of the media samples recorded by the given network camera, in storage units of network cameras of the subset.

CROSS REFERENCE TO RELATED APPLICATION

This application claims the benefit under 35 U.S.C. §119(a)-(d) ofUnited Kingdom Patent Application No. 1614335.6 filed on Aug. 22, 2016and entitled “METHOD, PROCESSING DEVICE AND SYSTEM FOR MANAGING COPIESOF MEDIA SAMPLES IN A SYSTEM COMPRISING A PLURALITY OF INTERCONNECTEDNETWORK CAMERAS”. The above cited patent application is incorporatedherein by reference in its entirety.

FIELD OF THE INVENTION

The present invention relates in general to the management of mediasamples in a system comprising several network cameras interconnectedthrough a network in a distributed and decentralized context. Inparticular, the present invention is directed to a method for managingcopies of media samples recorded by a network camera of a systemcomprising a plurality of interconnected network cameras, to aprocessing device implementing the method and to such a system.

BACKGROUND OF THE INVENTION

In a system comprising several network cameras interconnected through anetwork in a distributed and decentralized context, each network camerais able to record video samples and store them in one or several storageunits, for instance an embedded memory card (e.g. SD card or flashcard). It is well known that storage units have limited memory space andthat video recording applications involve the handling of a huge amountof data. Also, memory cards have a limited number of write/read cycles.

Thus, a challenging issue is to maximize the amount of recorded videodata stored in the overall system to allow efficient post-processing orforensic analysis.

In addition, the system may be modified over time during operation, forinstance by adding or disconnecting some cameras or their storage units,or by changing the spatial configuration of the system. As a result,loss of information directed to video content recorded by a camera thatis no longer available (e.g. camera disconnected or storage unit stolen)may occur. The reliability (i.e. availability and security) of recordeddata is thus a real challenge in video recording applications.

Consequently, there is a need for improving the storage of recordedmedia samples in the system while ensuring reliable access to recordedmedia samples.

SUMMARY OF THE INVENTION

The present invention has been devised to address one or more of theforegoing concerns.

According to a first aspect of the invention, there is provided a methodfor managing copies of media samples recorded by a given network cameraof a system comprising a plurality of interconnected network cameras.The method comprises the following steps:

-   -   obtaining a topology of the system as a set of relationships        existing between the network cameras of the plurality, based on        media samples recorded by these network cameras;    -   selecting a subset of network cameras from the plurality, based        on the determined topology and a predetermined level of        redundancy to achieve, for the storage of the copies of the        media samples recorded by the given network camera, in storage        units of network cameras of the subset.

Therefore, the method of the invention makes it possible to improve thereplication process of media samples. Thus, even if one network camerais removed from the system, the media samples stored in the storage unitof this network camera are still accessible in the storage unit ofanother network camera of the system.

The selection step based on the topology of the whole system makes itpossible to avoid needless duplication of a recorded video sample in thesystem while the probability of loss of information directed to videocontent in case of modification of the system is decreased. Hence, atrade-off between the reliability of the system and the storage memoryusage is thus achieved.

Optional features of the invention are further defined in the dependentappended claims.

According to embodiments, a copy of media samples recorded by the givennetwork camera is sent to at least one selected network camera of thesubset.

According to embodiments, a copy of media samples recorded by the givennetwork camera is transmitted to all the network cameras of theplurality or a predefined number of randomly selected network cameras,and a copy is removed from a storage unit of at least one network camerathat does not belong to the subset.

Hence, the reliability of recorded data is ensured until the memory ofsystem is full. When the memory of one network camera is full, anefficient removal process maintains a high reliability in the system bycarefully deleting low priority data.

According to embodiments, the method comprises determining a level ofredundancy as the number of cameras that can be removed from the systemwithout causing loss of information directed video content at the systemlevel.

According to embodiments, determining a topology as a set ofrelationships between regions of a scene comprises the following steps:

-   -   extracting a first set of visual descriptors characterizing        visual features of a first region of the scene, based on a first        image data set, each visual descriptor being associated with a        first extraction date;    -   obtaining a second set of visual descriptors characterizing        visual features of a second region of the scene, based on a        second image data set;    -   determining, for each visual descriptor of the first set, a        number of occurrences and a second extraction date based on a        distribution model generated based on other visual descriptors;    -   selecting a subset of visual descriptors from among visual        descriptors of the first set in function of their determined        number of occurrences and second extraction date;    -   comparing at least one visual descriptor of the subset with at        least one visual descriptor of the second set;    -   based on the result of the comparing step, determining a        relationship between the first region and the second region.

According to embodiments, determining a topology comprises groupingnetwork cameras of the plurality in clusters of network camerasaccording to a clustering criterion.

According to embodiments, a cluster is a set of network cameras with anon-null probability to detect a same target.

Non-null may mean greater than a predetermined threshold, for instance80%.

According to embodiments, selecting is such that network camerasbelonging to the subset do not belong to the same cluster as the givennetwork camera.

Hence, a good spatial diversity between network cameras of the subsetstoring the copies of a same sample is ensured. In other words, thenetwork cameras storing the copies are well apportioned in space.

According to embodiments, selecting comprises setting a number of copiesof the media samples recorded by the given network camera to be kept inthe storage units of the network cameras of the system, based on thepredetermined level of redundancy to achieve.

According to embodiments, the topology is formalized as a graph, eachvertex of the graph being associated to at least one network camera andeach edge of the graph corresponding to a relationship existing betweennetwork cameras.

According to embodiments, the number of copies is computed based on aminimum distance between a given node of the graph representing thegiven network camera and another node representing its closest sourcecamera in the system, and the distance between the given noderepresenting the given network camera and another node representing itsclosest sink camera in the system, wherein a source camera is defined asthe first camera of the system capturing media samples of new objectsand a sink camera is defined as the last camera of the system capturingmedia samples of objects.

According to embodiments, the number of copies is computed based on:

-   -   a length of a first path between a given node representing the        given network camera and another node representing a source        camera in the system, and    -   a length of a second path between the given node representing        the given network camera and another node representing a sink        camera in the system, wherein the first and second paths are        computed based on their respective probability of being taken by        a mobile target.

According to embodiments, the first path is between the given networkcamera and its closest source camera in the system, and the second pathis between the given network camera and its closest sink camera in thesystem.

According to embodiments, selecting comprises ordering the networkcameras of the plurality according to a priority criterion and selectingthe network cameras according to their priority.

According to embodiments, the priority criterion is a distance betweenthe vertex of a given camera and the vertices of all the other camerasin the system and wherein the network cameras having the smallestdistances have the highest priorities.

According to embodiments, selecting is performed according to at leastone selection criterion among the following criteria:

-   -   the memory space available in a considered network camera, thus        avoiding sending a sample that cannot be stored due to        insufficient memory space;    -   the number of read/write cycles already performed in memory of a        considered network camera, thus avoiding over-usage of storage        units.

According to embodiments, each relationship of the topology ischaracterised by a transition probability.

According to a second aspect of the invention, there is provided asystem for managing copies of media samples comprising a plurality ofinterconnected network cameras, the media samples being recorded by agiven network camera of the system.

The system comprises a processing unit configured for:

-   -   obtaining a topology of the system as a set of relationships        existing between the network cameras of the plurality, based on        media samples recorded by these network cameras;    -   selecting a subset of network cameras from the plurality, based        on the determined topology and a predetermined level of        redundancy to achieve, for the storage of the copies of the        media samples recorded by the given network camera, in storage        units of network cameras of the subset.

There is also provided a system for managing media samples, the systemcomprising:

-   -   a plurality of interconnected network cameras, each network        camera comprising capturing means for capturing media samples,        communication means for communicating with other network cameras        of the system and a storage unit for storing media samples        captured by the network camera or received via the communication        means from another network camera;    -   clustering means for forming a cluster of network cameras for        which there is a non-null probability of re-identifying a same        object in the video data captured by all network cameras of the        cluster; and    -   storage management means for managing distributed storage of        media samples captured by the plurality of network cameras        between the associated storage units, based on media samples        stored in the storage units of the cluster of network cameras.

The other aspects of the present invention have optional features andadvantages similar to the first aspect above-mentioned.

The present invention is also directed to a system substantially ashereinbefore described with reference to, and as shown in FIG. 1, amethod substantially as hereinbefore described with reference to, and asshown in FIGS. 2, 3, 5, 7 and 8, and a processing device substantiallyas hereinbefore described with reference to, and as shown in FIG. 9.

Since the present invention may be implemented in software, the presentinvention may be embodied as computer readable code for provision to aprogrammable apparatus on any suitable carrier medium, and in particulara suitable tangible carrier medium or suitable transient carrier medium.A tangible carrier medium may comprise a storage medium such as a memorycard, a floppy disk, a CD-ROM, a hard disk drive, a magnetic tape deviceor a solid state memory device or the like. A transient carrier mediummay include a signal such as an electrical signal, an electronic signal,an optical signal, an acoustic signal, a magnetic signal or anelectromagnetic signal, e.g. a microwave or RF signal.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention will now be described, by way of exampleonly, and with reference to the following drawings in which:

FIG. 1 illustrates a multi-camera networking system in which embodimentsof the invention may be implemented:

FIG. 2 is a flowchart illustrating general steps of a method formanaging copies of video samples performed at a processing deviceaccording to embodiments;

FIG. 3 is a flowchart illustrating steps for determining the topology ofa system according to embodiments;

FIG. 4 comprises FIGS. 4a, 4b, 4c and 4d which illustrate exemplarytopologies according to embodiments in which Boolean transition modelsare considered;

FIG. 5 is a flowchart illustrating steps for selecting a subset ofnetwork cameras according to embodiments in which Boolean transitionmodels are considered;

FIG. 6 illustrates an exemplary topology comprising a weighted anddirected graph according to embodiments;

FIG. 7a is a flowchart illustrating steps for selecting a subset ofnetwork cameras based on the topology of FIG. 6, according toembodiments in which continuous probability transition models areconsidered:

FIG. 7b is a flowchart illustrating a variant of FIG. 7 a;

FIG. 8 is a flowchart illustrating steps for removing copies in anetwork camera according to embodiments; and

FIG. 9 is a block diagram representing an exemplary architecture of aprocessing device in which steps of one or more embodiments may beimplemented.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

In the following description, a system comprising a plurality ofinterconnected network cameras is considered.

According to general embodiments, it is proposed to keep a copy of mediasamples recorded by a given network camera of the system into at leastone other network camera of the system selected based on the topology ofthe system previously determined and also a predetermined level ofredundancy (or resilience) to achieve.

It should be noted that the resilience is the ability of handling thedisappearing of a storage unit from the system while the redundancy is ameans to provide this ability.

This level of redundancy is computed in function of the number ofnetwork cameras with at least one storage unit (a network camera maycomprise one or several storage units) that can be removed from thesystem without causing information loss at the system level, i.e.ensuring that for each real object or part of it (e.g. a target)recorded by the system of network cameras, at least one recorded mediasample of this real object is available in a storage unit of the system.

According to first embodiments, only the selected network cameras willreceive a copy of the media samples.

According to second embodiments, all the network cameras of the systemwill receive a copy of the media samples and a removing process will beperformed so as to remove a copy from a storage unit of at least onenetwork camera that is not selected.

The number of copies to keep in the system at a given time, equally wellreferred to as the number of replications (or duplications), isdetermined based on the topology of the system so as to achieve thepredetermined level of redundancy (or resilience).

Thanks to the present invention, undesirable duplicating of recordedsamples in the system is avoided while the probability of loss ofinformation directed to video content in case of modification of thesystem is decreased.

FIG. 1 illustrates a system in which embodiments of the invention may beimplemented. A typical context is video surveillance applicationswherein cameras monitor an area of space.

This system 100 comprises a plurality of network cameras 101, 102, 103.Each network camera comprises capturing means for capturing media data(video and/or audio), communication means 111, 112, 113, forcommunicating with other network cameras and a storage unit (e.g. anmemory card such as a SD card or a flashcard, or a hard disk) forstoring video data captured by the network camera or received via thecommunication means from another network camera.

The network cameras 101, 102, 103 are interconnected through acommunication network 104 that enables exchanges of messages (e.g. videodata) with each other using the communication paths 105, 106, 107. Thecommunication network 104 is for instance an IP-based local or wide areanetwork (LAN, WAN) and the communication protocol may be an IP protocolsuch as HTTP over TCP or RTP over UDP.

This system 100 also comprises a processing device configured to managethe storage of media samples over the system. The processing device maybe embedded in one or several of the cameras 101, 102, 103 or may beanother device (e.g. a server device) connected to the communicationnetwork 104. An exemplary architecture for the processing device isdescribed with reference to FIG. 9.

In some embodiments, the network cameras are smart cameras. This kind ofcamera provides sufficient processing resources to perform video contentanalyses for instance to detect movement of real objects (for restrictedresources devices) and other simple image processing up to more complexalgorithms such as face recognition or re-identification algorithms forhigh processing rate devices. A smart camera typically includes localstorage memory such as a memory card or equivalent for storing recordedmedia samples.

In practice, a smart camera is configured to capture (i.e. record) atleast part of a scene and store the captured data in a temporary memoryuntil they are processed by a Video Content Analysis module of the smartcamera. When the processing results in the detection of an event (forinstance motion detection or object persistence over time), the smartcamera stores the data subsequently captured in a memory card forfurther processing, for instance forensic analysis. In other words, thesmart camera is able to record media samples (video and/or audio) on amemory card upon event detection (typically motion detection) related toa real object e.g. a target that is useful for specific forensicanalysis. Advantageously, memory space is saved.

In the given example, the system of network cameras is represented as adecentralized system wherein each camera is configured to behave as anautonomous agent in a multi-agent system, i.e. in an autonomous way toperform distributed tasks. In such a system, each camera may performtasks and estimate a global view of the system (which can be sharedbetween cameras), for instance the results of local processing in theother cameras of the system. However, the present invention is notlimited thereto or to smart cameras and also applies to a centralizedsystem wherein cameras interact with each other through a server(external processing device) which aggregates all data. Also, it mayapply to a semi-centralized system wherein a subset of main camerasperforms tasks for the other cameras of the system. The person skilledin the art can easily adapt the following description to centralized andsemi-centralized approaches.

FIG. 2 is a flowchart illustrating steps of a method for managing copiesof media samples recorded by a given network camera of a system (e.g.system 100) comprising a plurality of interconnected network camerasaccording to embodiments. These steps are performed by a processingdevice of the system. In the given example, these steps are performed ineach camera of the system (distributed approach). In variants, some ofthese steps could be performed by a server processing device(centralized approach), or a subset of main cameras for the others(semi-centralized approach).

At preliminary step 201, a level of redundancy to achieve (also calledresilience level) is obtained. It may correspond to the number ofnetwork cameras (a given network camera may comprise one or severalmemory cards) that can be removed from the system without causinginformation loss at the system level, i.e. ensuring that for each realobject recorded by the system of network cameras, at least one recordedvideo sample of this real object is available in a storage unit.

The level of redundancy takes into account the fact that a given targetmay be captured by several network cameras. The level of redundancy isthus less than the total number of cameras connected in the system.

For example, a level of redundancy equal to 1 (respectively 4) meansthat it is possible to disconnect up to 1 (respectively 4) networkcamera(s) from the system while still ensuring that each sample recordedupon detection of an event (e.g. movement of the target, abandonedobject, disappearance of an object, door opening) captured by the systemis still available in a storage unit of another network camera.

The level of redundancy chosen for the system may be a fixed (static)value, for instance equal to 2 or another fixed value determined as afunction of the number of network cameras in the system. For instance,it can be computed as the ceiling value of a percentage (typically 20%)of the total number of cameras.

The present invention is not limited to embodiments where the level ofredundancy is a fixed value and a value changing over time could be usedin other embodiments. For instance, the latest value of the level ofredundancy (i.e. obtained during the last iteration) could be retrieved.

At step 202, the topology is determined based on media samples (e.g.images) recorded by the network cameras. The topology is a set of links(relationships) existing between the content of media samples recordedby the network cameras. It allows determination of whether or not thereal object will be captured by several network cameras in the system.The set of links which represents the topology may be represented by agraph wherein each node (or vertex) corresponds to a network camera (ora specific spatial region of a scene captured by one network camera) andan edge between two nodes represents the relationship link between thetwo corresponding cameras.

Several criteria may be used to determine relationships (i.e. thepresence of links and optionally, their robustness or strength) betweennetwork cameras. Examples of topologies are described with reference toFIGS. 4 (Boolean transition models) and 6 (continuous probabilitytransition models).

In general terms, the present invention is not limited to relationshipsbetween network cameras only. For example, the topology may also bedetermined as relationships between spatial regions. The person skilledin the art may easily adapt the description to topologies betweenspatial regions of network cameras, for instance by considering eachregion as a virtual network camera.

In practice, the topology of the system may be the result of thecomparison of descriptors of images captured by the network cameras ofthe system. This is described in more detail with reference to FIG. 3.In a variant, the topology is set manually by the installer of thesystem.

It should be noted that steps 201 and 202 are independent and thus, insome embodiments, step 201 may be performed after step 202.

Based on the topology of the system thus determined, a selection process(also called replication (duplication) process) is performed at step203, during which a subset of network cameras is selected for thestorage of either copies of media samples or parts of them. In thefollowing description, the terms “media sample” refer either to acomplete media sample or part of it. In practice, a module subdividesthe media sample into parts and generates new media samples for eachpart of media sample. Also, this module associates information with eachnew media sample thus generated. This information includes data whichmakes it possible to retrieve the original media sample and also timinginformation, for instance the time of capture of the sample or the timeduration of this sample. It is recalled that a set S_(A) is a “subset”of a set S_(B), if S_(A) is contained inside S_(B), that is, allelements of S_(A) are also elements of S_(B). The network cameras of thesubset are the network cameras of the system that will keep (i.e. keeprecorded) the copies of media samples in memory while the other cameras(not belonging to the subset) will not.

In practice, this process may comprise a preliminary step of determiningthe number of copies (replications) needed to achieve the level ofredundancy obtained at step 201, given the topology of the system. Thispreliminary step is described in details with reference to step 505 ofFIG. 5. In this case, the selection of the subset of network camerasthat will store the replicated samples is based on this number, asdescribed in details with reference to steps 506 (Boolean transitionmodels) and 706 (continuous probability transition models) of FIGS. 5and 7.

FIG. 3 is a flowchart illustrating steps for determining the topology(e.g. at step 202 of FIG. 2) of a system according to embodiments. Thesesteps may for instance result in one of the topologies shown in FIG. 4or 6.

It has been observed that the relationships between network cameras maychange over time.

For illustrative purposes only, the flow of travelers in a train stationis considered. During the morning, the travelers may preferably movefrom their residence location to business centres while at noon they maymove from business centres to a restaurant location. Finally, in theevening they may move from business centres to their residence location.The direction of the travelers flow thus evolves during the day and sothe relationships between scenes captured by the network cameras alsoevolve.

Embodiments of the present invention allow dynamic estimation of therelationships between the cameras in particular for distributed contextsas shown in FIG. 1.

In practice, each network camera extracts a set of characteristicdescriptors of the objects (e.g. real objects such as targets, othercomponents of a scene) captured. These descriptors may provideinformation on the captured scene, for example about colours (forexample a descriptor can be a histogram of colours in the form of amatrix comprising 25 elements or components), textures, structures (e.g.shapes), and specific points of interest of the scene. Then, thetopology is determined in the system as a set of relationships betweenregions of the scene, by performing the following steps:

-   -   extracting a first set of visual descriptors characterizing        visual features of a first region of the scene, based on a first        image data set, each visual descriptor being associated with a        first extraction date;    -   obtaining a second set of visual descriptors characterizing        visual features of a second region of the scene, based on a        second image data set;    -   determining, for each visual descriptor of the first set, a        number of occurrences and a second extraction date based on a        distribution model generated based on other visual descriptors;    -   selecting a subset of visual descriptors from among visual        descriptors of the first set in function of their determined        number of occurrences and second extraction date;    -   comparing at least one visual descriptor of the subset with at        least one visual descriptor of the second set;    -   based on the result of the comparing step, determining a        relationship between the first region and the second region. In        first embodiments, each network camera computes its own        descriptors and compares them with descriptors received from        other network cameras. In this way, the relationships between a        given network camera and the other network cameras of the system        may be determined locally at the given network camera. FIG. 3        illustrates an example of the first embodiments. The descriptors        are exchanged at step 301 which means that each network camera        sends some descriptors to other network cameras while receiving        descriptors sent from these other network cameras. The        descriptors received are then compared locally with descriptors        related to the scene captured by the given network camera (step        302). For instance, these descriptors may be reference        descriptors of a distribution model of descriptors extracted        locally over time.

If there is a similarity between the descriptors of two cameras, it isasserted (step 303) that a relationship exists between the given networkcamera and the network camera from which are received the descriptors.Optionally, the number of matched descriptors allows computation of arelationship probability that will be used for defining the weighteddirected topology graph of the system.

On the contrary, if all the descriptors received from another networkcamera are never sufficiently close to the given network camera filmedscene, the relationship between the two network cameras does not existand no edge is added between their two corresponding vertices in thetopology graph.

In order to know the relationships existing between the other networkcameras of the system, each given network camera may receive therelationships locally determined by the other network cameras of thesystem and may send its own locally determined relationships to theother network cameras of the system (step 304). The topology of thewhole system is then computed at each given network camera as theaggregation of these locally determined relationships.

In second embodiments (not shown), a given network camera receivesdescriptors from all the other network cameras and compares thedescriptors from each pair of network cameras in order to establish therelationships (or absence of relationships) for each pair and computesthe topology of the system based on them. In this case, the givennetwork camera sends the topology to all the network cameras of thesystem.

In third embodiments (not shown), the plurality of cameras ispartitioned into groups, and in each group, a network camera receivesdescriptors from other network cameras of the group, computes therelationships for the network cameras of the group and the relationshipsof the groups are exchanged with the other groups. The topology of thewhole system is then computed at the network cameras as an aggregationof the relationships determined for the different groups (e.g. as in thefirst embodiments).

FIG. 4 comprises FIGS. 4a, 4b, 4c and 4d which illustrate exemplarytopologies by their graph representation that may be determined at step202, for instance according to the process described with reference toFIG. 3.

In the examples shown in FIG. 4, a binary model allows definition of aBoolean model of transition for each pair of cameras in the system. Therelationship between two cameras can take two values: either therelationship link probability that an object seen by a camera is or willbe seen by the other camera is high (i.e. above a threshold, forinstance 0.5), or this probability is low (below the threshold). Asshown in FIG. 4a , such a topology may be represented by an undirectedgraph 400 where a vertex 401 (or node) is associated with a givennetwork camera (or a given spatial region of the network camera), andwhere an edge 402 from a first vertex 401 to a second vertex 403represents a link between two network cameras.

The Boolean model of transition may take into account the temporalaspect or the order of appearance of the real object (or target). Thismeans that the relationship may be expressed as the probability thatsomething (a moving object for example) captured at a given region of(filmed by) a camera is or will be also visible in another camera aftera given amount of time. In this case, the edges (relationship) betweenpairs of vertexes (network cameras) are directed as shown by arrows onthe directed topology graph of FIGS. 4b, 4c and 4 d.

In the example of FIG. 4c , the camera corresponding to node 407, whichis not linked to any other ones, represents a network camera which hasno relationship with another network camera and thus is independent,i.e. this network camera captures real objects that are not likely to becaptured by any other network camera of the system (i.e. the probabilityto be captured by another camera of the system is below a threshold).

The present invention is not limited to Boolean models of transition andmore advanced models of transition (e.g. continuous probability models)may also be used, and may include a temporal probability distribution(i.e. the probabilities that the same object will be visible in thesecond region after given amounts of time), and/or a conditionalprobability distribution (e.g. the probability that the same object willbe visible in the region if it is visible in another one or theprobability if it is not visible).

The set of probabilities for all the pairs of network cameras of thesystem defines a model of transition which is represented by a weighted(un)directed graph wherein the weight of each edge or directed edge isthe relationship link probability. An example of topology based on morecomplex transition models is shown in FIG. 6 where the transition modelsare not based on Boolean values but rather on continuous probabilities.Some general information provided in the description of FIG. 4 may alsoapply to the example shown in FIG. 6, as Boolean values may also be seenas probabilities below or above a threshold.

In the exemplary topologies shown in FIGS. 4a and 4c , a systemcomprising five network cameras is considered. In the exemplarytopologies shown in FIGS. 4b and 4d , a system comprising twelve networkcameras is considered. Obviously, the present invention is not limitedto systems comprising five or twelve cameras and general embodimentscomprise at least two network cameras.

In some embodiments, the determination of topology takes into accountthe travelling paths of real moving objects. In other words,probabilities (e.g., resulting from statistics) on real moving objectdisplacements provide for information about the cameras that may havecaptured a given object/target. This is described in detail withreference to FIG. 7 b.

For the sake of illustration, a video surveillance system of threenetwork cameras noted A, B and C is considered. A target observed in thesystem is first captured by network camera A, then by network camera Band finally by network camera C. During the topology determinationprocess, a relationship is observed between network cameras A and B,network cameras A and C and finally network cameras B and C.Nevertheless, the time of appearance of the target in the networkcameras reveals that the relationship between network cameras A and C isnot direct, for example because the target observed by network camera Ais captured by network camera C just after network camera B has observedthe same target.

In some embodiments, determining a topology comprises grouping networkcameras of the system in clusters of network cameras according to aclustering criterion.

According to a clustering criterion, a cluster of network cameras ismade of network cameras that interact exclusively or in a privileged way(as opposed to exclusively) with each other. For instance, the clusteris defined by the installer based on the knowledge of the site monitoredby the cameras.

Typically, when considering a site having two buildings with two sets ofnetwork cameras which respectively film each building entrance and roominside the building, the two sets of network cameras may define twoclusters.

Such an example is shown in FIG. 4b where clusters 404 and 405correspond to cameras in each building which were clustered by theinstaller.

The clustering criteria may be used for automatically defining clustersbased on the estimated topology graph of the system. For instance, thenotion of cluster could be defined for an undirected graph according tothe graph theory as any of the following possibilities:

-   -   a connected component of the undirected graph.    -   cliques of graphs, i.e. a set of nodes of a graph forming a        complete sub-graph; in the example of FIG. 4a , when 5-vertices        cliques are considered, there is only a single network camera        cluster 400. In addition, the graph is complete, i.e. every pair        of distinct nodes is connected by a unique edge, which is        typically obtained for video surveillance systems where network        cameras monitor all entrances of a single building and people        may enter and leave the building from any entrance. When        4-vertices cliques are considered, there is 5 clusters as shown        in FIG. 4a , and each camera may be in different clusters.        For directed graphs the notion of cluster may be defined as        follows:    -   a strongly connected component (a sub-graph comprising pairs        (u, v) of vertices, wherein each vertex of a pair is reachable        by a directed path between u and v and also a directed path        between v and u) of the directed graph;    -   a connected component (a sub-graph comprising pairs (u, v) of        vertices, wherein each vertex of a pair is reachable by a        directed path between u and v, or a directed path between v        and u) of the directed graph;    -   a set of cycles in the graph, i.e. sequences of nodes starting        and ending at the same node, with each two consecutive nodes in        a given sequence being adjacent to each other in the graph        (closed walks) and possibly with no repetitions of nodes and        edges allowed, other than the repetition of the starting and        ending nodes, or as the set of edges in such a walk (simple        cycles);    -   a sub-graph of a graph composed of a set of vertices which are        connected with an average degree (the degree of a vertex is        equal to the number of vertices it is connected to) greater than        a predetermined value and such that the number of vertices        connected to the sub-graph but not belonging to the sub-graph is        below a second predetermined value. With this definition, as        shown in FIG. 4c , there are two clusters 406 and 407 in the        graph: the first one comprises four nodes (i.e. network cameras        or network camera regions) and the second one has only a single        node.

These other clustering criteria are less restrictive than the first onedescribed before (e.g. “strongly connected components”) and makes itpossible to distinguish nodes that are “more” connected to others. Itshould be noted that when considering such clustering criteria, theexample of FIG. 4d comprises several clusters instead of a singlecluster. For instance, if the clustering criteria is to gather“connected components” of the directed graph, two clusters can bedefined in the FIG. 4d whereas four clusters are formed when theclustering criteria is to gather “strongly connected components”.

One network camera may belong to several clusters.

FIG. 5 is a flowchart illustrating steps for selecting a subset ofnetwork cameras according to embodiments in which Boolean transitionmodels are considered. These steps may be implemented during theselection process 203 of FIG. 2 and may be based on one of thetopologies shown in FIG. 4.

In the given example, this selection process is implemented as aprocessing loop successively applied to each sample recorded by a givennetwork camera (step 501) until all recorded samples are processed. Inother words, for each sample captured by a given network camera, asubset of other network cameras that will receive and keep a copy ofthis sample (entire sample or just a subpart) is determined. In avariant (not shown), only some of the samples are processed during theselection process (e.g. one third of the samples arbitrarily chosen orchosen based on their quality, the location of the scene, etc.)

This exemplary process comprises the determination of a number of copies(replication number) needed to achieve a predetermined level ofredundancy given the type of network cameras linked to the given networkcamera in the topology graph of the system (step 502) and given thelocation of the given camera in this topology graph (step 503 and 504).Once this number of copies is determined (step 505), a subset of networkcameras is selected (step 506) for receiving and storing the copies ofthe sample in memory (step 507).

The selection of the network cameras of the subset may be based onseveral criteria such as the cluster to which the network camera belongs(to ensure a good spatial diversity between network cameras storing thecopies of a same sample), the memory space available (to avoid sending asample that cannot be stored due to insufficient memory space), thenumber of read/write cycles already performed in memory (to avoidover-usage of storage units).

The number of copies of the sample may be adapted in function of severalcriteria such as the quality of the sample (to avoid duplicating a badquality sample not very useful for forensic analysis), the location ofthe real object captured in the sample (to allow the spotting of aforbidden access or abnormal behaviours), the proximity in time units ofa specific “event” detection (door opening, forbidden area access).

In some embodiments examples of which are described hereafter, selectingcomprises ordering the network cameras of the plurality according to apriority criterion and selecting the network cameras according to theirpriority. Hence, a set of network camera candidates is preselected andthen ordered in a priority list according to the priority criterion. Inthis case, the subset finally selected is typically composed of the Rcandidates having the highest priority in the priority list, with Rbeing the replication number.

First, the topology of the system is retrieved at step 502 and the typeof each network camera linked to the considered camera is determined.The type of a network camera can be one of sink, source or intermediate,according to the following definitions:

-   -   a source camera is defined as a first camera capturing media        samples of new objects. It corresponds for instance to the        camera filming the entrance of a building;    -   a sink camera is complementary to a source camera and is defined        as the last camera capturing media samples of objects        (previously seen by one camera). It corresponds for instance to        the camera filming objects leaving the space covered by the        video surveillance system;    -   an intermediate camera is a camera which captures objects        already captured by a first camera and that will then be also        captured by a second camera.

When the topology graph is directed (i.e. when the time is taken intoaccount), the considered camera is a source (respectively a sink) cameraif the corresponding vertex in the graph is also a source (respectivelya sink) vertex i.e. the indegree (respectively the outdegree) of thevertex is 0. When both indegree and outdegree are not null, the camerais of type “intermediate”.

When the topology graph is undirected (i.e. when the time is not takeninto account), indegree and outdegree of each vertex are equal sinceeach edge is considered as bidirectional. Consequently, the consideredcamera is a source (respectively a sink) camera if the correspondingvertex in the graph is also a source (respectively a sink) vertex i.e.the degree of the vertex is below or equal to 1. When the degree isgreater than one, the type of the camera is intermediate.

For instance, the cluster 405 in FIG. 4b is composed of six cameras. Thevertex 451 corresponds to a source camera since all its edges areoutgoing. On the contrary, the vertex 452 is connected to only incomingedges and thus its associated camera is a sink camera. Finally, anexample of intermediate camera is the one associated with the vertex 453because it has both incoming and outgoing edges.

In another embodiment, the network topology graph includes not onlyvertices which correspond to a given type of camera but also verticeswhich represent both a source and a sink in the system. For instance, ina typical video surveillance site, entrances of a building are alsoexits. As a consequence, it is very likely that the network camerascapturing the entrance of a building have both incoming and outgoingedges i.e. at least one bidirectional relationship with another camera.In such a case, the network camera is considered as an intermediatecamera whereas it does not comply with the definition of an intermediatecamera.

In order to solve this confusion, when generating the topology graph ofrelationships at step 202, it is estimated whether the objects capturedby a given camera have been captured elsewhere by another camera. Inthis case, it means the given camera captures objects appearing for thefirst time in the space watched by the video surveillance system. A newvirtual node which is considered as the source of this object is addedto the graph and connected to the given camera. On the other hand, whenit is detected that objects captured by a given camera are neverobserved by another camera, a new virtual node referred to as a sinknode is connected to this camera. Hence, each camera vertex may beconnected either to another camera vertex and/or to a source vertexand/or a sink vertex. A camera is considered as a sink (respectively asource) when it is connected to a sink (respectively a source) vertex. Acamera may thus be both a source and sink camera, from a topologicalpoint of view.

In the given example, the number of replications for each recordedsample is computed based on the type of each camera node. In practice,the number of replications will be higher when the object is likely toleave the area monitored by the video surveillance system and has notbeen recorded by several cameras. Conversely, the number of replicationswill be smaller when the object has already been filmed by severalcameras. Thus, a higher replication number is set when the real objectis filmed by a source camera and a smaller replication number is setwhen the camera is an intermediate or a sink camera. This is because ina sink or an intermediate camera, the object which observation(detection) triggers the recording of the new video sample has beenfilmed by at least two network cameras: the given camera (the sample ofwhich is currently processed) and the source camera.

In the given example, the number of replications depends on the numberof network cameras that have filmed or are going to film an object. Thisnumber corresponds to the number of samples that will be recorded in thewhole system.

In practice, the determination of the number of replications comprisesestimating the location of the given network camera in the topologygraph, in particular with respect to the source cameras and sink cameras(steps 503 and 504).

In this example, the minimum number of cameras which are expected tocapture the object after it has been captured by the given networkcamera, is equal to the number of network cameras located on the minimumpath to an exit of the building watched by the system. This number isequal to the minimum path (in the topology graph) between the givencamera vertex and one of the sink camera vertices of the system and isdetermined at step 503.

This number may be obtained either based on the whole camera systemtopology graph or by performing a recursive process consisting ofdetermining the length to the closest sink camera. It is checked whetherone of the linked cameras is a sink camera. If none is a sink, thelength is incremented by 1 and each linked camera applies the sameprocess until one sink is detected. At the end, the length value isequal to the minimum distance to a sink camera. Stop conditions aredefined in the recursive process to avoid processing the same cameratwice.

In the following, the minimum distance estimated at step 503 is denotedK.

The second number to determine is the number of times the object hasalready been captured by other network cameras. Similarly to the processapplied for determining the distance to one of the closest sink camerasat step 503, the minimum path to the closest source node is computed atstep 504. In the following description, the minimum distance estimatedin 504 is denoted P.

According to this embodiment, the minimum distances are determined so asto maximize the number of replications to apply. As a consequence, theresulting number of replications actually observed may be slightlyhigher than the number of replications expected since the object maytake a path which is longer than the minimum path (to the closest sink).According to a second embodiment, the number of replications is computedbased on weighted minimum distances (Step 705 of FIG. 7a ). According toa third embodiment, the number of replications rather considers the mostprobable path taken by an object (target). An example of this thirdembodiment is described with reference to FIG. 7 b.

The number of replications R is computed at step 505 as the differencebetween the current number of replications and the sum of the distance Kto the closest source camera (determined in 504) and the distance P tothe closest sink camera (determined in 503). In the first iteration, thecurrent number of replications is set to an initial value R0 equal tothe redundancy level obtained at step 201 of FIG. 2. For instance, ifthe redundancy level is 2 (it is required to support the disconnectionof two network cameras) the initial number of replications R0 is also 2(i.e. there are three different versions of the media sample in thememory of the cameras in the whole system).

If the number of replications thus computed is negative or null, thereis no need to duplicate the media sample currently considered and thenext media sample may be directly processed. Otherwise, each copy of therecorded media sample is forwarded to other cameras in the camera systemthat will be selected at step 506.

At step 506, the selection of camera candidates is for instanceperformed such that network cameras belonging to a cluster differentfrom the one of the given camera are selected first. Advantageously, anetwork camera (e.g. a source) having already another view of the objectseen in the sample considered will not be selected.

In one embodiment which minimizes the computations, the copies are thensent to all the candidate cameras that thus form the selected subset.

For each sample, it may be checked whether the amount of availablememory is big enough to receive the sample. When it is not the case, thecurrent candidate camera is not selected to be in the subset. In avariant, if the memory size of a network camera is below a threshold(e.g. set to 25% of total memory size) it may be removed from the set ofcandidates, or it may be attributed a low priority.

In another embodiment, selecting comprises ordering the network camerasaccording to a priority criterion and selecting the network camerasaccording to their priority and the number of replications R computed atstep 505.

For instance, the priority criterion is the memory size available ineach network camera. In this case, the candidates are ordered bydecreasing available memory size. In this way, it is avoided to send acopy to a network camera which cannot store the data in its memory.Bandwidth is thus saved.

In a variant, all other network cameras in the same cluster as the givencamera are added to the set of candidates and ordered by decreasingavailable memory size.

In another embodiment, the priority criterion is the number orread/write cycles performed in each candidate. This is because forspecific memory technology (such as flash memory), the number ofread/write cycles may be limited. Thus, the candidates are ordered fromthe one having the smallest number of read/write cycles undergone to theone having the highest number of read/write cycles undergone. The numberof cycles may be requested from each network camera of the system usingan HTTP request. Advantageously, this alternative effectively preventsoverloading one camera with a lot of read/write cycles and also avoids apremature end of its storage means.

Another possible priority criterion may be provided to minimize theprobability of replication of media samples in a camera which hasalready filmed the object which triggers the recording. The distance(according to the graph theory) between the vertex of the given cameraand the vertices of all other cameras in the system is computed and thecandidates are ordered by decreasing order of the distance values. Thenetwork cameras vertices which are not connected (i.e. in a differentcluster or not accessible due to the edge directions) have an infinitedistance and are thus prioritized. If the estimation of the distance isperformed through a recursive process as presented above, it is possibleto define an early stop condition. The recursive process could end oncethe distance is strictly greater than the redundancy level to ensurethat the same network camera is not systematically selected for keepingthe copy when an object is successively captured by each network cameraalong its path.

In all the cases, a number of R remaining candidates (thus equal to thenumber of replications R) having the highest priority is selected to bepart of the subset of network cameras that will receive and keep a copyof the considered sample in memory.

Step 507 corresponds to the reception and the storing of the copies ofthe sample in memory. According to an embodiment, the camera receivingthe sample sends an acknowledgment to the camera that has previouslysent the given sample. It advantageously permits to detect atransmission error.

In the example described above, the network camera type is estimated foreach sample (in each iteration of the process of FIG. 5) in order toadapt to the modification of topology for each sample of the camera.However, in the case where the topology of the system is stable overtime, the processing of steps 502 to 507 may be computed only for thefirst sample and the number of replications and the same subset ofnetwork cameras for the replication is reused for all the other samplescaptured by the given network camera. However, if the selection isperformed according to the available memory space in the system, thesubset of network cameras for the replication may be updated for eachnew sample, since each camera in the subset may have recorded newsamples meanwhile, and thus available memory size may have changed.

In another embodiment, the number of replications is also adapted as afunction of the quality of the recorded sample. The quality of therecorded sample may be defined as a function of the shooting angle ofthe camera and/or the object orientation, for instance, to favour theduplication of video samples which facilitate the identification of theobject.

Typically, for each sample, it is analysed whether the object may beeasily identified (for example through a face recognition algorithm). Ifthe object cannot be recognized, a redundancy penalty value (for example−2) is added to the redundancy level determined at step 201, whichavoids duplicating a bad quality video sample.

On the other hand, if the zoom factor of the camera allowscharacteristics of the object to be easily detected and extracted, aredundancy advantage value (typically 2) is added to the redundancylevel. The quality of the recorded sample may also be a function of theresolution or the recording frame rate of the network camera, or thelength of the recorded sample.

In another embodiment, the quality/importance of the recorded sample isdefined as a function of the location of the object. To this end,specific high importance areas (e.g. forbidden zones) may be defined ineach network camera. When an object is observed in this area, a higherimportance (or quality) is associated with the recorded sample to forcea higher resilience level for the recorded sample by adding apre-determined value (e.g. 2) to the replication number determined in505.

FIG. 6 illustrates an exemplary topology comprising a weighted anddirected graph according to embodiments that may be determined at step202, for instance according to the process described with reference toFIG. 3.

This is a topology graph of probabilities (here, not Boolean values) inwhich network camera relationships are represented by edges and weightscorresponding to the probability that an object observed by the networkcamera (possibly virtual) at the tail end of the edge will be thenobserved by the network camera (possibly virtual) at the head end.

In the example of FIG. 6, the vertices 601, 602 and 607 are virtualnetwork camera nodes which represent a source vertex (601) and sinkvertices (602 and 607). The network camera associated with vertex 603 isthus simultaneously a sink, a source and an intermediate network camera.The vertices 604, 605 and 606 correspond to intermediate network camerasand vertex 606 is in addition a sink camera.

FIG. 7a is a flowchart illustrating steps for selecting a subset ofnetwork cameras according to embodiments in which continuous probabilitytransition models are considered. These steps may be implemented duringthe selection process 203 of FIG. 2 and may be based on the weightedtopology of FIG. 6.

In this example, the computation of the minimum paths to the sink andsource made in 503 and 504 is modified. During these steps, in additionto the minimum path to each sink (respectively source) of the system,the probability that this minimum path to each sink (respectivelysource) is (respectively has been) used by the object observed in thecurrent camera is computed in 703 (respectively in 704). Thisprobability is for instance equal to the product of weights on the edgeof the minimum path to each source (respectively sink). During thesesteps, the minimum distances to source vertices denoted Ki (where i isthe index of the source vertex) are associated with probabilities ki(where i is the index of the source vertex). Similarly, the minimumdistances to sink vertices denoted Pi are associated with theprobabilities pi.

In the given example, the determination of the number of replications(step 705) is also modified in order to take into account theprobability that the object may follow one or another path to a sink. Inpractice, the set of minimum distances to each source is ordered bydecreasing order of probabilities. The same principle is applied forminimum distances to the sink. The highest probable path to a sink (or asource) is thus the first of the ordered list.

In a first variant, the replication number is computed as the followingdifference:

R=R0−Ki0−Pj0

-   -   where:    -   R0 is the initial replication number (typically equal to the        level of redundancy obtained at step 201 of FIG. 2);    -   i0 is the index of the source vertex which is the most probable;    -   j0 is the index of the most probable sink vertex;    -   Ki0 is the minimum distance to the source vertex which is the        most probable, i.e. the source for which the object has the        highest probability to be originated from;    -   Pj0 is the minimum distance to the sink vertex which is the most        probable, i.e. the sink for which the object has the highest        probability to be originated from.

If the replication number is negative or null, no replication isperformed. To avoid edge effects when the two first sources (or sinks)with indices i1 and i2 share a similar probability (i.e. the absolutedifference between the probabilities is less than a predeterminedthreshold, typically 0.1), the minimum of distances Ki1 and Ki2 is usedto compute the number of replications R.

Similar processing is performed for sinks. The advantage of determiningthe most probable path to a source or sink instead of using the closestone is to minimize the number of replications. For example, with thetopology graph of FIG. 6, the network camera 604, without taking intoaccount the probabilities of transitions to the source or sink, maycompute a replication number R equal to 1 if R0 is equal to 3 (K=1,P=1). When taking into account the probabilities, the highest sinkprobability is associated with the vertex 606 and thus the number ofreplications R is 0 (K=1, Pi0=2 where i0 is the index of 606).

Advantageously, the probabilities represented in this graph allow themost probable sink to be determined.

In one alternative, the selection process of network cameras (step 706)differs from the step 506 of FIG. 5, notably because it comprisesordering the network camera candidates as follows:

Step 1: the sink which has the highest probability pi is selected fromthe set of not processed sinks;

Step 2: network cameras on the minimum length path to the selected sinkare selected;

Step 3: the network cameras selected at step 2 are ordered according totheir decreasing distance to the given network camera;

These three steps are repeated for each sink and the process ends whenall the sinks have been processed. This selection process maximizes theprobabilities that the copies of the sample are sent to the networkcameras having the highest probabilities of later observing the object.Preferably, a removing process is further applied, as described withreference to FIG. 8.

According to a variant of this example, the number of replicationsconsiders the most probable path taken by an object (target). Thisvariant is described with reference to FIG. 7b . It applies to caseswhere the topology is represented as a directed graph comprising edgeswith which are associated probabilities.

In this variant, the steps 501, 502 and 507 are the same as those ofFIG. 5.

At step 713, all paths lengths to a sink are computed as well as, foreach path, the probability of having been taken by the mobile target.

At step 714, all paths lengths to a source are computed as well as, foreach path, the probability of having been taken by the mobile target.

At step 715, the replication number is set based on the source path withthe highest probability and the sink path with the highest probability.

At step 716, a subset of network cameras is selected based on thereplication number thus set. For instance, this step is similar to step506 or 706 described before.

FIG. 8 is a flowchart illustrating steps for removing copies in anetwork camera according to embodiments.

According to first embodiments, a copy of media samples recorded by agiven network camera may be sent only to the network cameras of thesubset as in the examples described previously, and a removal process isthen applied in order to free some additional space in the system.

The memory consumption is reduced by removing duplicates or unneededcopies of samples in some network cameras.

This removal process may be implemented in each network camera. Forinstance, it may be implemented in addition to the process describedearlier, either sequentially or in parallel.

After the storage (step 801) of media samples copies received from othernetwork cameras of the system, when a new media is recorded (test 802)in the considered network camera, it is compared to the received copiesstored in memory of the considered network camera (803).

When the new recorded media sample and one of the copies are similar(i.e. it is the same object, or the new recorded sample does not provideenough new information on the object), the copy is erased from thememory of the considered network camera (804) because it is declared notuseful.

For determining whether the new recorded sample and one of the samplescopies stored in memory are similar, a recognition algorithm may beapplied to the new recorded sample. If the recognition algorithmidentifies the same target than the one in the copy, the copy isremoved. As another example, a comparison algorithm may be used, whichis based on the comparison of descriptors (e.g. histograms) extractedfrom the new sample and from the stored samples copies. In particular,the Bhattacharyya distance between the two histograms may be computed toevaluate the similarity of the two samples. If the samples are similar,one of the copies is erased.

In a particular embodiment, the sending of a sample copy from a givennetwork camera to network cameras of the selected subset may bepostponed. This may be the case when the number of objects observed inthe system is small (low activity). In this case, the considered networkcamera generating the copies may postpone the sending of the copies tothe subset of network cameras selected. To this end, it may send amessage to the selected network cameras, for instance to notify that anew object should be observed later by one of them. By using a temporaltransition model determined for the pairs of network cameras, a maximumduration after which the object will not be observed by a selectednetwork camera can be estimated.

For example, when each pair of cameras (or each directed edge of thetopology) is associated with a probable time Tp representing theduration after which an object seen by a camera of the pair is likely tobe seen by the other camera of the pair, the maximum duration afterwhich the object will not be observed is equal to Tp+Dp with Dp being apredetermined delay. The set of probable times Tp for all the pairs maybe represented by a Gaussian curve.

Once this maximum duration has elapsed without the observation of a newobject by the selected network camera, the copy is finally sent to it.Otherwise (if the given network camera received a notification in duetime) the copy is not sent. Advantageously, the bandwidth consumption isreduced in the system.

In another embodiment, when a network camera or all storage units of acamera is removed from the system, each network camera of the systemupdates its topology graph (i.e. the process loops back to step 202 ofFIG. 2, and a new topology graph i.e. a new set of relationships(transition models) is obtained) and a new level of redundancy may beobtained at step 201 of FIG. 1. For instance, the current redundancylevel may be compared to the new number of network cameras in thesystem. If the current redundancy level is greater than or equal to thenumber of network cameras, the new redundancy level may be decrementedby one unit for each removed network camera.

When a network camera or at least one storage unit of the camera isremoved from the system, after the redundancy level to achieve has beenupdated, the selection process of step 203 may be applied again to eachrecorded media sample of a given network camera in order to send a newcopy in the system to replace the copies that were stored in memory ofthe removed network camera or of the at least one storage unit.

According to second embodiments, a copy of media samples recorded by agiven network camera may be sent to all the network cameras, or apredefined number of randomly selected network cameras (typically halfof the network cameras in the system) of the plurality and a copy isremoved from a storage unit of at least one network camera that does notbelong to the subset.

For example, copies of samples are sent so long as the memory of thenetwork cameras remains sufficient to store the copies and the locallyrecorded samples. Once the memory is full, an erosion process (removalprocess) is applied to determine in which camera the copies are to beremoved.

According to a basic implementation, the copies of a same sample areremoved from the storage units of all the network cameras that do notbelong to the subset of selected network cameras determined at step506/706.

In practice, each copy may be associated with a specific flag indicatingthat it is stored in a network camera belonging to the subset (flag setto “true”) or not (flag set to “false”).

When the memory of a considered network camera is full, a removalprocess comprising the following steps may be performed, for instance aslong as the memory available remains sufficient (for instance to storeat least 1 minute of video):

-   -   add in a high priority set all copies having a flag set to        “false”;    -   add in a low priority set all copies having flag set to “true”;    -   order each set (low priority and high priority) from the oldest        to the most recent copy;    -   if the high priority set is not empty, delete the first copy of        the set and stop the process;    -   if the low priority set is not empty, delete the first copy of        the set and stop the process;    -   delete the oldest media sample recorded by the considered        network camera.

Advantageously, the reliability of recorded data is ensured until thememory of the system is highly used. When the memory of one networkcamera is full, an efficient removal process maintains a highreliability of the system by carefully deleting low priority data.

FIG. 9 represents a block diagram of a processing device 900, forinstance one of the network cameras shown in FIG. 1 or a dedicatedserver, in which steps of one or more embodiments may be implemented.

The device 900 comprises a communication bus 902 to which there arepreferably connected:

-   -   a central processing unit 904, such as a microprocessor, denoted        CPU;    -   a read only memory 906, denoted ROM, for storing computer        programs for implementing the invention;    -   a random access memory 908, denoted RAM, for storing the        executable code of methods according to embodiments of the        invention as well as the registers adapted to record variables        and parameters necessary for implementing methods according to        embodiments of the invention;    -   a communication interface 912 connected to a network 914 over        which a communication can be implemented between the device 900        and a network camera connected to the network; and    -   a data storage means 910 such as a hard disk, for storing        computer programs for implementing steps of one or more        embodiments of the invention and for storing data, during the        implementation of one or more embodiments of the invention.

Optionally, the device 900 may also include a user interface 916 todisplay information to, and/or receive inputs from, a user. Forinstance, it may be a screen serving as a graphical interface with auser, or other means such as a keyboard or any other pointing means.

The communication bus 902 provides communication and interoperabilitybetween the various elements included in the device 900 or connected toit. The representation of the bus is not limiting and in particular theCPU 904 is operable to communicate instructions to any element of thedevice 900 directly or by means of another element of the device 900.

The disk 910 can be replaced by any information medium such as forexample a compact disk (CD-ROM), rewritable or not, a ZIP disk or amemory card and, in general terms, by an information storage means thatcan be read by a microcomputer or by a microprocessor, integrated or notinto the device, possibly removable, and adapted to store one or moreprograms whose execution enables a method according to the invention tobe implemented.

Instructions relating to the software application may be loaded to themain memory 908 from a Hard-Disk 910 or the program ROM 906 for example.According to a variant, the executable code of the programs can bereceived by means of the communication network 914, via the interface912, in order to be stored in one of the storage means of the device900, such as the hard-disk 910, before being executed. Such softwareapplication, when executed by the CPU 904, causes the steps describedwith reference to FIG. 2, 3, 5, 7 or 8 to be performed in the device900.

The CPU 904 is adapted to control and direct the execution of theinstructions or portions of software code of the program or programsaccording to the invention, which instructions are stored in one of theaforementioned storage means. On powering up, the program or programsthat are stored in a non-volatile memory, for example on the hard-disk910 or in the ROM 906, are transferred into the RAM 908, which thencontains the executable code of the program or programs, as well asregisters for storing the variables and parameters necessary forimplementing the invention.

In this embodiment, the device is a programmable apparatus which usessoftware to implement the invention. However, alternatively, the presentinvention may be implemented in hardware (for example, in the form of anApplication Specific Integrated Circuit or ASIC). It can consist of oneor more dedicated integrated circuits that are capable of implementingthe method as described with reference to FIG. 2, 3, 5, 7 or 8.

While the invention has been illustrated and described in detail in thedrawings and foregoing description, such illustration and descriptionare to be considered illustrative or exemplary and not restrictive, theinvention being not restricted to the disclosed embodiment. Othervariations to the disclosed embodiment can be understood and effected bythose skilled in the art in putting into practice (i.e. performing) theclaimed invention, from a study of the drawings, the disclosure and theappended claims.

In the claims, the word “comprising” does not exclude other elements orsteps, and the indefinite article “a” or “an” does not exclude aplurality. A single processor or other unit may fulfil the functions ofseveral items recited in the claims. The mere fact that differentfeatures are recited in mutually different dependent claims does notindicate that a combination of these features cannot be advantageouslyused. Any reference signs in the claims should not be construed aslimiting the scope of the invention.

1. A method for managing copies of media samples recorded by a givennetwork camera of a system comprising a plurality of interconnectednetwork cameras, the method comprising: determining a topology of thesystem as a set of relationships existing between the plurality ofinterconnected network cameras, based on media samples recorded by theplurality of interconnected network cameras; and selecting a subset ofnetwork cameras from the plurality of interconnected network cameras,based on the determined topology and a predetermined level of redundancyto achieve, for storage of the copies of the media samples recorded bythe given network camera, in storage units of the subset of networkcameras.
 2. The method according to claim 1, further comprising sendinga copy of media samples recorded by the given network camera to at leastone selected network camera of the subset of network cameras.
 3. Themethod according to claim 1, further comprising: transmitting a copy ofmedia samples recorded by the given network camera to each of theplurality of interconnected network cameras or to a predefined number ofrandomly selected network cameras; and removing a copy from a storageunit of at least one network camera that does not belong to the subsetof network cameras.
 4. The method according to claim 1, furthercomprising determining a level of redundancy as the number of camerasthat can be removed from the system without causing loss of informationdirected video content at the system level.
 5. The method according toclaim 1, wherein determining a topology as a set of relationshipsbetween regions of a scene comprises: extracting a first set of visualdescriptors characterizing visual features of a first region of thescene, based on a first image data set, wherein each visual descriptoris associated with a first extraction date, obtaining a second set ofvisual descriptors characterizing visual features of a second region ofthe scene, based on a second image data set, determining, for eachvisual descriptor of the first set of visual descriptors, a number ofoccurrences and a second extraction date based on a distribution modelgenerated based on other visual descriptors, selecting a subset ofvisual descriptors from among visual descriptors of the first set ofvisual descriptors in function of their determined number of occurrencesand second extraction date, comparing, as a comparing step, at least onevisual descriptor of the subset of visual descriptors with at least onevisual descriptor of the second set of visual descriptors, anddetermining, based on a result of the comparing step, a relationshipbetween the first region of the scene and the second region of thescene.
 6. The method according to claim 1, wherein determining atopology comprises grouping network cameras of the plurality ofinterconnected network cameras in clusters of network cameras accordingto a clustering criterion.
 7. The method according to claim 6, wherein acluster is a set of network cameras with a non-null probability todetect a same target.
 8. The method according to claim 6, whereinselecting is such that network cameras belonging to the subset ofnetwork cameras do not belong to the same cluster as the given networkcamera.
 9. The method according to claim 1, wherein selecting comprisessetting a number of copies of the media samples recorded by the givennetwork camera to be kept in storage units of plurality ofinterconnected network cameras of the system, based on the predeterminedlevel of redundancy to achieve.
 10. The method according to claim 1,wherein the determined topology is formalized as a graph, wherein eachvertex of the graph is associated to at least one network camera, andwherein each edge of the graph corresponds to a relationship existingbetween network cameras.
 11. The method according to claim 10, wherein anumber of copies of the media samples is computed based on a minimumdistance between a given node of the graph representing the givennetwork camera and another node representing its closest source camerain the system, and a distance between the given node representing thegiven network camera and another node representing its closest sinkcamera in the system, wherein a source camera is defined as the firstcamera of the system capturing media samples of new objects and a sinkcamera is defined as the last camera of the system capturing mediasamples of objects.
 12. The method according to claim 11, wherein thenumber of copies is computed based on: a length of a first path betweena given node representing the given network camera and another noderepresenting a source camera in the system, and a length of a secondpath between the given node representing the given network camera andanother node representing a sink camera in the system, wherein the firstand second paths are computed based on their respective probability ofbeing taken by a mobile target.
 13. The method according to claim 12,wherein the first path is between the given network camera and itsclosest source camera in the system, and the second path is between thegiven network camera and its closest sink camera in the system.
 14. Themethod according to claim 1, wherein selecting comprises ordering theplurality of interconnected network cameras according to a prioritycriterion and selecting the network cameras according to their priority.15. The method according to claim 14, wherein the priority criterion isa distance between a vertex of a given camera and vertices of all theother cameras in the system, and wherein the network cameras having thesmallest distances have the highest priorities.
 16. The method accordingto claim 1, wherein selecting is performed according to at least oneselection criterion among the following criteria: the memory spaceavailable in a considered network camera, and the number of read/writecycles already performed in memory of a considered network camera. 17.The method according to claim 10, wherein each relationship of thedetermined topology is characterized by a transition probability.
 18. Asystem for managing copies of media samples, the system comprising: aplurality of interconnected network cameras, wherein the media samplesare recorded by a given network camera of the system; one or moreprocessors; and memory storing instructions that, when executed by theone or more processors, cause the system to perform operationscomprising: determining a topology of the system as a set ofrelationships existing between the plurality of interconnected networkcameras, based on media samples recorded by the plurality ofinterconnected network cameras, and selecting a subset of networkcameras from the plurality of interconnected network cameras, based onthe determined topology and a predetermined level of redundancy toachieve, for storage of the copies of the media samples recorded by thegiven network camera, in storage units of the subset of network cameras.19. (canceled)
 20. A computer-readable storage medium storinginstructions of a computer program for implementing the method accordingto claim 1.